Processing Of Syntax And Semantics Of Natural Language By Predicate Logic Of Predicate Logic
نویسنده
چکیده
The syntax and semantic analyses of natural language are described from the standpoint of manmachine communication. The knowledge based system KAUS(Knowledge Acquisition and Utilization System) which has capabilities of deductive inference and automatic program generation of database access is utilized for that purpose. We try to perform syntax and semantic analyses of English sentences more or less conccurently by defining the correspondence between the basic patterns of English and the extended atomic formula in the framework of KAUS. Knowledge representation based on sets and logic, the sentence analysis utilizing this knowledge are given with some examples.
منابع مشابه
A Logic of Arbitrary and Indefinite Objects
A Logic of Arbitrary and Indefinite Objects, LA, has been developed as the logic for knowledge representation and reasoning systems designed to support natural language understanding and generation, and commonsense reasoning. The motivations for the design of LA are given, along with an informal introduction to the theory of arbitrary and indefinite objects, and to LA itself. LA is then formall...
متن کاملPredicate logic with flexibly binding operators and natural language semantics
A new formalism for predicate logic is introduced, with a non-standard method of binding variables, which allows a compositional formalization of certain anaphoric constructions, including ‘donkey sentences’ and crosssentential anaphora. A proof system in natural deduction format is provided, and the formalism is compared with other accounts of this type of anaphora, in particular Dynamic Predi...
متن کاملAutomated Reasoning I∗
Preliminaries abstract reduction systems well-founded orderings Propositional logic syntax, semantics calculi: DPLL-procedure, . . . implementation: 2-watched literals, clause learning First-order predicate logic syntax, semantics, model theory, . . . calculi: resolution, tableaux, . . . implementation: sharing, indexing First-order predicate logic with equality term rewriting systems calculi: ...
متن کاملMeta-theory of first-order predicate logic
We present a formalization of parts of Melvin Fitting’s book “FirstOrder Logic and Automated Theorem Proving” [1]. The formalization covers the syntax of first-order logic, its semantics, the model existence theorem, a natural deduction proof calculus together with a proof of correctness and completeness, as well as the Löwenheim-Skolem theorem.
متن کاملOn Logical Formulation of the Computation Process in Semantical Systems
In the recent years there is an intensive search for a rigorous and explicit semantics in the theory of natural languages (and in the field of computer languages). In this paper we want to present a general framework in which all these ideas and results can be stated and related in a unified and systematic way, and at the same time, by the using of the language of predicate logic, eventually of...
متن کامل